On semi-simple radical classes

On Semi/tame Classes of Finite Structures

We modify the definition of robust chains from [25] as an approach to formalizing the Finite Sub-model Property (see [21], for example) from the perspective of a class of finite structures with a generic model (i.e. having the Amalgamation and Joint-embedding properties). We characterize this formulation, which we call super-robustness, modulo a weaker condition (that is closer to the the situa...

On Hyper P-Semi Simple I-algebra

In this paper we introduce the concepts of hyper P -semisimple Ialgebra and Abelian hyper I-algebra and we state and prove some related results. The hyper p-semi simple I-algebras is a generalization of p-semisimple BCI-algebras and a subclass of hyper I-algebras. Specially we show that every Abelian hyper I-algebra is a hyper psemisimple I-algebra and a commutative canonical hypergroup. In fol...

Semi-θ-Open Sets and New Classes of Maps

Semi-simple splicing systems

In 1987 Tom Head [5] introduced the idea of splicing as a generative mechanism in formal language theory. This mechanism was popularized and extensively developed by Gheorghe Păun and his many coworkers, who recognized much of the subtlety and power of this mechanism and who used it as a foundation for the rapidly developing study of DNA based computing. See, for example, [11] and [12]. (The mo...

Remarks on random walks on semi simple Lie groups

© Mémoires de la S. M. F., 1977, tous droits réservés. L’accès aux archives de la revue « Mémoires de la S. M. F. » (http:// smf.emath.fr/Publications/Memoires/Presentation.html) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impress...